Matching theory

Instrument dependency of Kubelka-Munk theory in computer color matching

Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...

Matching Theory

Chapter 2. Matching Theory. 2.1. What Is Matching Theory?

An elementary example of matching theory is the following puzzle (popularized by R. Gomory). Given a standard 8× 8 chessboard, can it always be covered by dominoes (a piece consisting of two squares) if one arbitrary black square and one arbitrary white square are deleted? The solution is given in the exercises. Another puzzle which involves the idea of matchings is the following Putnam problem...

Theory of matching pursuit

We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound is tighter than the KPCA bound of Shawe-Taylor et al [7] and highly predictive of the size of the subspace needed to capture most of the variance in the data. We analyse a second matching pursuit algorithm called kern...

A random matching theory

We develop theoretical underpinnings of pairwise random matching processes. We formalize the mechanics of matching, and study the links between properties of the different processes and trade frictions. A particular emphasis is placed on providing a mapping between matching technologies and informational constraints.